________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:17:30
Input Data from:  dataset112.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,183
Average f[i]   :3750
Average g[i,j] :1866,66666666667
Total demand   :5320
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 8
> Selected Move:	1140	1	-1	9	6000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1    >new incumb.: 1140


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 31
> Selected Move:	1210	1	-1	3	11000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1    >new incumb.: 1210


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 33
> Selected Move:	1880	1	-1	5	16500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1    >new incumb.: 1880


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 37
> Selected Move:	2000	3	1	4	18500


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  0  1    >new incumb.: 2000


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 31
> Selected Move:	2300	3	9	6	17000


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  0  0    >new incumb.: 2300


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 32
> Selected Move:	2300	4	4	3	16100


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 34
> Selected Move:	2300	4	3	5	16500


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 32
> Selected Move:	2300	4	5	6	17100


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 30
> Selected Move:	2300	3	0	9	19500


> New Y[]: 
	
	 0  0  4  1  1  1  3  0  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 17
> Selected Move:	2300	4	6	3	18500


> New Y[]: 
	
	 0  0  4  3  1  1  1  0  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 19
> Selected Move:	2300	4	3	4	19400


> New Y[]: 
	
	 0  0  4  1  3  1  1  0  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 15
> Selected Move:	2300	4	4	5	18900


> New Y[]: 
	
	 0  0  4  1  1  3  1  0  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 15
> Selected Move:	2300	4	5	9	17700


> New Y[]: 
	
	 0  0  4  1  1  2  1  0  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 21
> Selected Move:	2300	4	5	3	18300


> New Y[]: 
	
	 0  0  4  2  1  1  1  0  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 20
> Selected Move:	2300	4	3	4	19100


> New Y[]: 
	
	 0  0  4  1  2  1  1  0  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 15
> Selected Move:	2300	4	4	6	18900


> New Y[]: 
	
	 0  0  4  1  1  1  2  0  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 15
> Selected Move:	2300	4	9	3	19300


> New Y[]: 
	
	 0  0  4  3  1  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 18
> Selected Move:	2300	4	3	5	19700


> New Y[]: 
	
	 0  0  4  1  1  3  2  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 17
> Selected Move:	2300	4	5	6	19100


> New Y[]: 
	
	 0  0  4  1  1  2  3  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 15
> Selected Move:	2300	4	5	3	19700


> New Y[]: 
	
	 0  0  4  2  1  1  3  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 14
> Selected Move:	2300	4	6	4	19600


> New Y[]: 
	
	 0  0  4  2  3  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 15
> Selected Move:	2300	4	3	4	19500


> New Y[]: 
	
	 0  0  4  3  2  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 12
> Selected Move:	2300	4	3	5	19900


> New Y[]: 
	
	 0  0  4  1  2  3  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 14
> Selected Move:	2300	4	4	3	19100


> New Y[]: 
	
	 0  0  4  2  1  3  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 13
> Selected Move:	2300	4	3	5	18100


> New Y[]: 
	
	 0  0  4  3  1  2  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 16
> Selected Move:	2300	4	3	4	19000


> New Y[]: 
	
	 0  0  4  1  3  2  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 14
> Selected Move:	2300	3	4	8	18600


> New Y[]: 
	
	 0  0  4  1  0  2  1  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 22
> Selected Move:	2300	4	5	3	19200


> New Y[]: 
	
	 0  0  4  2  0  1  1  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 19
> Selected Move:	2300	4	3	6	19800


> New Y[]: 
	
	 0  0  4  1  0  1  2  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 19
> Selected Move:	2300	4	6	9	19000


> New Y[]: 
	
	 0  0  4  1  0  1  1  0  3  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 17
> Selected Move:	2300	4	8	3	19500


> New Y[]: 
	
	 0  0  4  3  0  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 19
> Selected Move:	2300	4	3	5	19900


> New Y[]: 
	
	 0  0  4  1  0  3  1  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 16
> Selected Move:	2300	4	5	9	18700


> New Y[]: 
	
	 0  0  4  1  0  2  1  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 19
> Selected Move:	2300	4	5	3	19300


> New Y[]: 
	
	 0  0  4  2  0  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 16
> Selected Move:	2300	4	3	6	19900


> New Y[]: 
	
	 0  0  4  1  0  1  2  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 17
> Selected Move:	2300	4	6	8	18800


> New Y[]: 
	
	 0  0  4  1  0  1  1  0  2  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 17
> Selected Move:	2300	4	9	3	19200


> New Y[]: 
	
	 0  0  4  3  0  1  1  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 16
> Selected Move:	2300	4	3	5	19600


> New Y[]: 
	
	 0  0  4  1  0  3  1  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 16
> Selected Move:	2266	4	8	3	20100


> New Y[]: 
	
	 0  0  4  2  0  3  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 15
> Selected Move:	2300	4	3	5	19100


> New Y[]: 
	
	 0  0  4  3  0  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 15
> Selected Move:	2267	4	3	6	20100


> New Y[]: 
	
	 0  0  4  1  0  2  3  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 18
> Selected Move:	2235	4	5	8	20200


> New Y[]: 
	
	 0  0  4  1  0  1  3  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 17
> Selected Move:	2178	3	8	7	20100


> New Y[]: 
	
	 0  0  4  1  0  1  3  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 20
> Selected Move:	2210	4	6	3	19100


> New Y[]: 
	
	 0  0  4  3  0  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 22
> Selected Move:	2210	4	3	5	19500


> New Y[]: 
	
	 0  0  4  1  0  3  1  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 18
> Selected Move:	2210	4	5	7	19100


> New Y[]: 
	
	 0  0  4  1  0  2  1  3  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 21
> Selected Move:	2210	4	5	3	19700


> New Y[]: 
	
	 0  0  4  2  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 17
> Selected Move:	2210	4	3	9	19500


> New Y[]: 
	
	 0  0  4  1  0  1  1  3  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 19
> Selected Move:	2210	4	7	9	18700


> New Y[]: 
	
	 0  0  4  1  0  1  1  2  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 19
> Selected Move:	2210	4	7	5	19700


> New Y[]: 
	
	 0  0  4  1  0  2  1  1  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 19
> Selected Move:	2182	4	9	3	20100


> New Y[]: 
	
	 0  0  4  3  0  2  1  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 18
> Selected Move:	2073	4	5	9	20500


> New Y[]: 
	
	 0  0  4  3  0  1  1  1  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 17
> Selected Move:	2210	3	9	0	18100


> New Y[]: 
	
	 2  0  4  3  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 33
> Selected Move:	2300	3	7	8	17100


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 32
> Selected Move:	2300	4	3	5	17500


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 32
> Selected Move:	2300	4	5	6	18100


> New Y[]: 
	
	 2  0  4  1  0  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 32
> Selected Move:	2300	4	6	8	16600


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 30
> Selected Move:	2210	3	8	7	17100


> New Y[]: 
	
	 2  0  4  1  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 31
> Selected Move:	2210	4	7	5	18500


> New Y[]: 
	
	 2  0  4  1  0  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 31
> Selected Move:	2210	4	5	6	19100


> New Y[]: 
	
	 2  0  4  1  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 30
> Selected Move:	1900	3	6	9	19200


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  0  3 


> New S[]: 
	
	 0  0  1  1  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 34
> Selected Move:	2008	3	0	6	20900


> New Y[]: 
	
	 0  0  4  1  0  1  2  1  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 18
> Selected Move:	2144	4	6	3	20300


> New Y[]: 
	
	 0  0  4  2  0  1  1  1  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 19
> Selected Move:	1974	4	9	5	21100


> New Y[]: 
	
	 0  0  4  2  0  3  1  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 16
> Selected Move:	2021	4	3	9	20900


> New Y[]: 
	
	 0  0  4  1  0  3  1  1  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 21
> Selected Move:	1903	4	5	6	21500


> New Y[]: 
	
	 0  0  4  1  0  1  3  1  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,21

## ITERATION 66 #######################


> Neighbours evaluated; 15
> Selected Move:	2195	3	7	8	20500


> New Y[]: 
	
	 0  0  4  1  0  1  3  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,215

## ITERATION 67 #######################


> Neighbours evaluated; 13
> Selected Move:	2150	4	9	3	20700


> New Y[]: 
	
	 0  0  4  2  0  1  3  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,22

## ITERATION 68 #######################


> Neighbours evaluated; 15
> Selected Move:	2234	4	3	6	20300


> New Y[]: 
	
	 0  0  4  3  0  1  2  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,225

## ITERATION 69 #######################


> Neighbours evaluated; 14
> Selected Move:	2143	4	3	5	20700


> New Y[]: 
	
	 0  0  4  1  0  3  2  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,23

## ITERATION 70 #######################


> Neighbours evaluated; 17
> Selected Move:	2000	3	6	0	19000


> New Y[]: 
	
	 2  0  4  1  0  3  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,235

## ITERATION 71 #######################


> Neighbours evaluated; 33
> Selected Move:	2000	4	5	3	18600


> New Y[]: 
	
	 2  0  4  3  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,24

## ITERATION 72 #######################


> Neighbours evaluated; 32
> Selected Move:	2000	4	3	8	18100


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,245

## ITERATION 73 #######################


> Neighbours evaluated; 29
> Selected Move:	2000	4	8	9	18200


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,25

## ITERATION 74 #######################


> Neighbours evaluated; 29
> Selected Move:	2000	3	8	4	17200


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  0  3 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,255

## ITERATION 75 #######################


> Neighbours evaluated; 30
> Selected Move:	2000	4	9	3	17600


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,25

## ITERATION 76 #######################


> Neighbours evaluated; 30
> Selected Move:	2000	4	3	5	18000


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,245

## ITERATION 77 #######################


> Neighbours evaluated; 29
> Selected Move:	1900	3	4	7	20000


> New Y[]: 
	
	 2  0  4  1  0  3  0  1  0  1 


> New S[]: 
	
	 0  0  1  1  0  1  0  0  0  0 
 > pw :0,24

## ITERATION 78 #######################


> Neighbours evaluated; 31
> Selected Move:	1900	4	5	3	19600


> New Y[]: 
	
	 2  0  4  3  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  1  0  1  0  0  0  0 
 > pw :0,235

## ITERATION 79 #######################


> Neighbours evaluated; 30
> Selected Move:	1905	3	0	6	21300


> New Y[]: 
	
	 0  0  4  3  0  1  2  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,23

## ITERATION 80 #######################


> Neighbours evaluated; 15
> Selected Move:	2141	4	3	7	20300


> New Y[]: 
	
	 0  0  4  1  0  1  2  3  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,225

## ITERATION 81 #######################


> Neighbours evaluated; 18
> Selected Move:	2255	3	7	4	20200


> New Y[]: 
	
	 0  0  4  1  3  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,22

## ITERATION 82 #######################


> Neighbours evaluated; 12
> Selected Move:	2190	4	4	6	20500


> New Y[]: 
	
	 0  0  4  1  2  1  3  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,215

## ITERATION 83 #######################


> Neighbours evaluated; 19
> Selected Move:	1740	3	6	1	18400


> New Y[]: 
	
	 0  3  4  1  2  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  1 
 > pw :0,21

## ITERATION 84 #######################


> Neighbours evaluated; 15
> Selected Move:	2258	3	2	6	20200


> New Y[]: 
	
	 0  3  0  1  2  1  4  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,215

## ITERATION 85 #######################


> Neighbours evaluated; 20
> Selected Move:	2300	4	4	3	19400


> New Y[]: 
	
	 0  3  0  2  1  1  4  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,22

## ITERATION 86 #######################


> Neighbours evaluated; 20
> Selected Move:	2300	4	3	5	18800


> New Y[]: 
	
	 0  3  0  1  1  2  4  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,225

## ITERATION 87 #######################


> Neighbours evaluated; 21
> Selected Move:	2300	4	5	6	18700


> New Y[]: 
	
	 0  3  0  1  1  4  2  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,23

## ITERATION 88 #######################


> Neighbours evaluated; 21
> Selected Move:	2300	4	5	3	19700


> New Y[]: 
	
	 0  3  0  4  1  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,235

## ITERATION 89 #######################


> Neighbours evaluated; 17
> Selected Move:	2300	4	3	4	19900


> New Y[]: 
	
	 0  3  0  1  4  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,23

## ITERATION 90 #######################


> Neighbours evaluated; 16
> Selected Move:	2300	4	4	9	18700


> New Y[]: 
	
	 0  3  0  1  1  1  2  0  0  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,225

## ITERATION 91 #######################


> Neighbours evaluated; 20
> Selected Move:	2300	4	6	3	18100


> New Y[]: 
	
	 0  3  0  2  1  1  1  0  0  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,22

## ITERATION 92 #######################


> Neighbours evaluated; 21
> Selected Move:	2300	4	3	4	18900


> New Y[]: 
	
	 0  3  0  1  2  1  1  0  0  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,215

## ITERATION 93 #######################


> Neighbours evaluated; 18
> Selected Move:	2300	4	4	5	17500


> New Y[]: 
	
	 0  3  0  1  1  2  1  0  0  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,21

## ITERATION 94 #######################


> Neighbours evaluated; 20
> Selected Move:	2300	4	5	9	17900


> New Y[]: 
	
	 0  3  0  1  1  4  1  0  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,205

## ITERATION 95 #######################


> Neighbours evaluated; 21
> Selected Move:	2300	4	5	3	18900


> New Y[]: 
	
	 0  3  0  4  1  1  1  0  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,2

## ITERATION 96 #######################


> Neighbours evaluated; 19
> Selected Move:	2300	4	3	4	19100


> New Y[]: 
	
	 0  3  0  1  4  1  1  0  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,195

## ITERATION 97 #######################


> Neighbours evaluated; 16
> Selected Move:	2300	4	4	6	19200


> New Y[]: 
	
	 0  3  0  1  1  1  4  0  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,19

## ITERATION 98 #######################


> Neighbours evaluated; 17
> Selected Move:	2300	3	9	0	16800


> New Y[]: 
	
	 2  3  0  1  1  1  4  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 99 #######################


> Neighbours evaluated; 34
> Selected Move:	2300	4	6	3	16500


> New Y[]: 
	
	 2  3  0  4  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,18

## ITERATION 100 #######################


> Neighbours evaluated; 33
> Selected Move:	2300	4	3	4	16700


> New Y[]: 
	
	 2  3  0  1  4  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 101 #######################


> Neighbours evaluated; 32
> Selected Move:	2300	4	4	5	15500


> New Y[]: 
	
	 2  3  0  1  1  4  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,17

## ITERATION 102 #######################


> Neighbours evaluated; 31
> Selected Move:	2300	3	4	8	16500


> New Y[]: 
	
	 2  3  0  1  0  4  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 103 #######################


> Neighbours evaluated; 34
> Selected Move:	2300	4	5	3	17500


> New Y[]: 
	
	 2  3  0  4  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,16

## ITERATION 104 #######################


> Neighbours evaluated; 33
> Selected Move:	2300	4	3	6	17800


> New Y[]: 
	
	 2  3  0  1  0  1  4  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,155

## ITERATION 105 #######################


> Neighbours evaluated; 32
> Selected Move:	2300	4	6	8	16900


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  4  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,15

## ITERATION 106 #######################


> Neighbours evaluated; 31
> Selected Move:	2300	3	0	9	19300


> New Y[]: 
	
	 0  3  0  1  0  1  1  0  4  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,145

## ITERATION 107 #######################


> Neighbours evaluated; 24
> Selected Move:	2300	4	8	3	19900


> New Y[]: 
	
	 0  3  0  4  0  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,14

## ITERATION 108 #######################


> Neighbours evaluated; 21
> Selected Move:	2300	4	3	5	18900


> New Y[]: 
	
	 0  3  0  1  0  4  1  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,135

## ITERATION 109 #######################


> Neighbours evaluated; 22
> Selected Move:	2300	4	5	9	18500


> New Y[]: 
	
	 0  3  0  1  0  2  1  0  1  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,13

## ITERATION 110 #######################


> Neighbours evaluated; 23
> Selected Move:	2300	4	5	3	19100


> New Y[]: 
	
	 0  3  0  2  0  1  1  0  1  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,125

## ITERATION 111 #######################


> Neighbours evaluated; 22
> Selected Move:	2300	4	3	6	19700


> New Y[]: 
	
	 0  3  0  1  0  1  2  0  1  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,12

## ITERATION 112 #######################


> Neighbours evaluated; 23
> Selected Move:	2300	4	6	8	18600


> New Y[]: 
	
	 0  3  0  1  0  1  1  0  2  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,115

## ITERATION 113 #######################


> Neighbours evaluated; 20
> Selected Move:	2300	4	9	3	19600


> New Y[]: 
	
	 0  3  0  4  0  1  1  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,11

## ITERATION 114 #######################


> Neighbours evaluated; 24
> Selected Move:	2300	4	3	5	18600


> New Y[]: 
	
	 0  3  0  1  0  4  1  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,105

## ITERATION 115 #######################


> Neighbours evaluated; 23
> Selected Move:	2300	4	5	6	19900


> New Y[]: 
	
	 0  3  0  1  0  1  4  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0999999999999996

## ITERATION 116 #######################


> Neighbours evaluated; 22
> Selected Move:	2300	4	8	5	19800


> New Y[]: 
	
	 0  3  0  1  0  2  4  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0949999999999996

## ITERATION 117 #######################


> Neighbours evaluated; 23
> Selected Move:	2300	4	5	6	19700


> New Y[]: 
	
	 0  3  0  1  0  4  2  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0899999999999996

## ITERATION 118 #######################


> Neighbours evaluated; 20
> Selected Move:	2300	4	6	3	19100


> New Y[]: 
	
	 0  3  0  2  0  4  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0849999999999996

## ITERATION 119 #######################


> Neighbours evaluated; 22
> Selected Move:	2300	4	3	5	19500


> New Y[]: 
	
	 0  3  0  4  0  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0799999999999996

## ITERATION 120 #######################


> Neighbours evaluated; 20
> Selected Move:	2300	4	3	8	18900


> New Y[]: 
	
	 0  3  0  1  0  2  1  0  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0749999999999996

## ITERATION 121 #######################


> Neighbours evaluated; 20
> Selected Move:	2300	4	5	3	19500


> New Y[]: 
	
	 0  3  0  2  0  1  1  0  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0699999999999996

## ITERATION 122 #######################


> Neighbours evaluated; 21
> Selected Move:	2300	3	8	4	19300


> New Y[]: 
	
	 0  3  0  2  4  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0649999999999996

## ITERATION 123 #######################


> Neighbours evaluated; 20
> Selected Move:	2300	4	3	4	19900


> New Y[]: 
	
	 0  3  0  4  2  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0599999999999996

## ITERATION 124 #######################


> Neighbours evaluated; 18
> Selected Move:	2300	4	3	5	18900


> New Y[]: 
	
	 0  3  0  1  2  4  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0549999999999996

## ITERATION 125 #######################


> Neighbours evaluated; 19
> Selected Move:	2300	4	4	3	18100


> New Y[]: 
	
	 0  3  0  2  1  4  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0499999999999996

## ITERATION 126 #######################


> Neighbours evaluated; 18
> Selected Move:	2300	4	3	5	18500


> New Y[]: 
	
	 0  3  0  4  1  2  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0449999999999996

## ITERATION 127 #######################


> Neighbours evaluated; 17
> Selected Move:	2300	4	3	4	18700


> New Y[]: 
	
	 0  3  0  1  4  2  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0399999999999996

## ITERATION 128 #######################


> Neighbours evaluated; 19
> Selected Move:	2210	3	4	7	19000


> New Y[]: 
	
	 0  3  0  1  0  2  1  4  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0349999999999996

## ITERATION 129 #######################


> Neighbours evaluated; 25
> Selected Move:	2210	4	5	3	19600


> New Y[]: 
	
	 0  3  0  2  0  1  1  4  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0299999999999996

## ITERATION 130 #######################


> Neighbours evaluated; 24
> Selected Move:	2210	4	3	7	19500


> New Y[]: 
	
	 0  3  0  4  0  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0249999999999996

## ITERATION 131 #######################


> Neighbours evaluated; 23
> Selected Move:	2210	4	3	5	18500


> New Y[]: 
	
	 0  3  0  1  0  4  1  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0199999999999996

## ITERATION 132 #######################


> Neighbours evaluated; 22
> Selected Move:	2240	1	-1	4	23000


> New Y[]: 
	
	 0  3  0  1  1  4  1  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0149999999999996

## ITERATION 133 #######################


> Neighbours evaluated; 27
> Selected Move:	2318	3	7	0	21500


> New Y[]: 
	
	 2  3  0  1  1  4  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,00999999999999962

## ITERATION 134 #######################


> Neighbours evaluated; 28
> Selected Move:	2710	1	-1	8	27000


> New Y[]: 
	
	 2  3  0  1  1  4  1  0  1  1 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,00499999999999962

## ITERATION 135 #######################


> Neighbours evaluated; 30
> Selected Move:	2745	4	5	9	27000


> New Y[]: 
	
	 2  3  0  1  1  1  1  0  1  4 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :-3,76434994286967E-16

## ITERATION 136 #######################


> Neighbours evaluated; 30
> Selected Move:	2780	4	9	3	28000


> New Y[]: 
	
	 2  3  0  4  1  1  1  0  1  1 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,00499999999999962

## ITERATION 137 #######################


> Neighbours evaluated; 29
> Selected Move:	2743	4	3	8	27400


> New Y[]: 
	
	 2  3  0  1  1  1  1  0  4  1 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,00999999999999962

## ITERATION 138 #######################


> Neighbours evaluated; 28
> Selected Move:	2705	3	8	7	27500


> New Y[]: 
	
	 2  3  0  1  1  1  1  4  0  1 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,0149999999999996

## ITERATION 139 #######################


> Neighbours evaluated; 30
> Selected Move:	2660	4	7	5	28000


> New Y[]: 
	
	 2  3  0  1  1  4  1  1  0  1 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,0199999999999996

## ITERATION 140 #######################


> Neighbours evaluated; 27
> Selected Move:	2620	4	5	9	28000


> New Y[]: 
	
	 2  3  0  1  1  1  1  1  0  4 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,0249999999999996

## ITERATION 141 #######################


> Neighbours evaluated; 28
> Selected Move:	2555	4	9	3	29000


> New Y[]: 
	
	 2  3  0  4  1  1  1  1  0  1 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,0299999999999996

## ITERATION 142 #######################


> Neighbours evaluated; 27
> Selected Move:	2504	4	3	4	29200


> New Y[]: 
	
	 2  3  0  1  4  1  1  1  0  1 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,0349999999999996

## ITERATION 143 #######################


> Neighbours evaluated; 27
> Selected Move:	2493	3	7	8	28200


> New Y[]: 
	
	 2  3  0  1  4  1  1  0  1  1 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,0399999999999996

## ITERATION 144 #######################


> Neighbours evaluated; 26
> Selected Move:	2460	3	4	2	26500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  1  0 
 > pw :0,0449999999999996

## ITERATION 145 #######################


> Neighbours evaluated; 38
> Selected Move:	2473	3	8	4	25500


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  1  1  0  0  0  0 
 > pw :0,0499999999999996

## ITERATION 146 #######################


> Neighbours evaluated; 35
> Selected Move:	2425	3	1	8	27100


> New Y[]: 
	
	 2  0  4  1  1  1  1  0  3  1 


> New S[]: 
	
	 0  0  1  1  0  1  0  0  0  0 
 > pw :0,0549999999999996

## ITERATION 147 #######################


> Neighbours evaluated; 30
> Selected Move:	2384	4	8	9	27200


> New Y[]: 
	
	 2  0  4  1  1  1  1  0  1  3 


> New S[]: 
	
	 0  0  1  1  0  1  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 148 #######################


> Neighbours evaluated; 30
> Selected Move:	2324	4	9	3	27600


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  1  1 


> New S[]: 
	
	 0  0  1  1  0  1  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 149 #######################


> Neighbours evaluated; 29
> Selected Move:	2260	4	3	5	28000


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  1  1 


> New S[]: 
	
	 0  0  1  1  0  1  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 150 #######################


> Neighbours evaluated; 28
> Selected Move:	2185	4	5	4	28500


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  1  1 


> New S[]: 
	
	 0  0  1  1  0  1  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 151 #######################


> Neighbours evaluated; 26
> Selected Move:	2135	4	4	6	28600


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  1  1 


> New S[]: 
	
	 0  0  1  1  0  1  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 152 #######################


> Neighbours evaluated; 26
> Selected Move:	2092	2	5	-1	23100


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,0849999999999996

## ITERATION 153 #######################


> Neighbours evaluated; 33
> Selected Move:	2204	4	6	8	21600


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  3  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,0899999999999996

## ITERATION 154 #######################


> Neighbours evaluated; 32
> Selected Move:	2320	3	8	1	20000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  1    >new incumb.: 2320


> New S[]: 
	
	 0  0  0  1  1  0  1  0  0  0 
 > pw :0,0949999999999996

## ITERATION 155 #######################


> Neighbours evaluated; 38
> Selected Move:	2300	3	9	5	19500


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,0999999999999996

## ITERATION 156 #######################


> Neighbours evaluated; 31
> Selected Move:	2250	3	3	9	20500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,105

## ITERATION 157 #######################


> Neighbours evaluated; 34
> Selected Move:	2215	3	4	3	21000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  1  1  0  0  0 
 > pw :0,11

## ITERATION 158 #######################


> Neighbours evaluated; 35
> Selected Move:	2245	3	9	8	20500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,115

## ITERATION 159 #######################


> Neighbours evaluated; 30
> Selected Move:	2205	3	5	9	21000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  1  0 
 > pw :0,12

## ITERATION 160 #######################


> Neighbours evaluated; 37
> Selected Move:	2120	3	3	5	21500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,125

## ITERATION 161 #######################


> Neighbours evaluated; 35
> Selected Move:	2050	3	6	3	22000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,13

## ITERATION 162 #######################


> Neighbours evaluated; 30
> Selected Move:	2170	3	8	4	21000


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,135

## ITERATION 163 #######################


> Neighbours evaluated; 29
> Selected Move:	2000	4	2	3	18000


> New Y[]: 
	
	 2  3  0  4  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,14

## ITERATION 164 #######################


> Neighbours evaluated; 33
> Selected Move:	2000	4	3	4	18200


> New Y[]: 
	
	 2  3  0  1  4  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,145

## ITERATION 165 #######################


> Neighbours evaluated; 31
> Selected Move:	2000	4	4	5	17000


> New Y[]: 
	
	 2  3  0  1  1  4  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,15

## ITERATION 166 #######################


> Neighbours evaluated; 30
> Selected Move:	2000	4	5	9	17000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  4 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,155

## ITERATION 167 #######################


> Neighbours evaluated; 30
> Selected Move:	2108	1	-1	6	21500


> New Y[]: 
	
	 2  3  0  1  1  1  1  0  0  4 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,16

## ITERATION 168 #######################


> Neighbours evaluated; 25
> Selected Move:	2100	3	5	8	21500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  4 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,165

## ITERATION 169 #######################


> Neighbours evaluated; 32
> Selected Move:	2135	3	9	5	21000


> New Y[]: 
	
	 2  3  0  1  1  4  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,17

## ITERATION 170 #######################


> Neighbours evaluated; 29
> Selected Move:	2062	4	5	8	21400


> New Y[]: 
	
	 2  3  0  1  1  1  1  0  4  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 171 #######################


> Neighbours evaluated; 29
> Selected Move:	2038	3	8	7	21500


> New Y[]: 
	
	 2  3  0  1  1  1  1  4  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,18

## ITERATION 172 #######################


> Neighbours evaluated; 30
> Selected Move:	2210	2	4	-1	17000


> New Y[]: 
	
	 2  3  0  1  0  1  1  4  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 173 #######################


> Neighbours evaluated; 32
> Selected Move:	2210	4	7	3	18500


> New Y[]: 
	
	 2  3  0  4  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,19

## ITERATION 174 #######################


> Neighbours evaluated; 32
> Selected Move:	2210	4	3	5	17500


> New Y[]: 
	
	 2  3  0  1  0  4  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 175 #######################


> Neighbours evaluated; 31
> Selected Move:	2210	4	5	6	18800


> New Y[]: 
	
	 2  3  0  1  0  1  4  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,2

## ITERATION 176 #######################


> Neighbours evaluated; 30
> Selected Move:	1970	3	0	9	21200


> New Y[]: 
	
	 0  3  0  1  0  1  4  1  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,205

## ITERATION 177 #######################


> Neighbours evaluated; 20
> Selected Move:	2259	3	7	8	20200


> New Y[]: 
	
	 0  3  0  1  0  1  4  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,21

## ITERATION 178 #######################


> Neighbours evaluated; 13
> Selected Move:	2216	4	9	3	20400


> New Y[]: 
	
	 0  3  0  2  0  1  4  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,215

## ITERATION 179 #######################


> Neighbours evaluated; 15
> Selected Move:	2150	4	3	6	20700


> New Y[]: 
	
	 0  3  0  4  0  1  2  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,22

## ITERATION 180 #######################


> Neighbours evaluated; 13
> Selected Move:	2278	4	3	8	20100


> New Y[]: 
	
	 0  3  0  1  0  1  2  0  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,225

## ITERATION 181 #######################


> Neighbours evaluated; 16
> Selected Move:	2165	3	8	7	20200


> New Y[]: 
	
	 0  3  0  1  0  1  2  4  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,23

## ITERATION 182 #######################


> Neighbours evaluated; 19
> Selected Move:	2210	4	6	7	19800


> New Y[]: 
	
	 0  3  0  1  0  1  4  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,235

## ITERATION 183 #######################


> Neighbours evaluated; 16
> Selected Move:	2210	4	6	9	18500


> New Y[]: 
	
	 0  3  0  1  0  1  1  2  0  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,24

## ITERATION 184 #######################


> Neighbours evaluated; 22
> Selected Move:	2210	4	7	5	19500


> New Y[]: 
	
	 0  3  0  1  0  2  1  1  0  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,245

## ITERATION 185 #######################


> Neighbours evaluated; 20
> Selected Move:	2210	4	5	9	19900


> New Y[]: 
	
	 0  3  0  1  0  4  1  1  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,25

## ITERATION 186 #######################


> Neighbours evaluated; 16
> Selected Move:	2210	4	5	7	19400


> New Y[]: 
	
	 0  3  0  1  0  1  1  4  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,255

## ITERATION 187 #######################


> Neighbours evaluated; 17
> Selected Move:	1981	4	7	3	20900


> New Y[]: 
	
	 0  3  0  4  0  1  1  1  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,26

## ITERATION 188 #######################


> Neighbours evaluated; 14
> Selected Move:	2184	4	3	9	20100


> New Y[]: 
	
	 0  3  0  2  0  1  1  1  0  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,265

## ITERATION 189 #######################


> Neighbours evaluated; 16
> Selected Move:	2184	4	9	5	20100


> New Y[]: 
	
	 0  3  0  2  0  4  1  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,27

## ITERATION 190 #######################


> Neighbours evaluated; 17
> Selected Move:	2075	4	3	5	20500


> New Y[]: 
	
	 0  3  0  4  0  2  1  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,275

## ITERATION 191 #######################


> Neighbours evaluated; 15
> Selected Move:	1990	4	3	6	20800


> New Y[]: 
	
	 0  3  0  1  0  2  4  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,28

## ITERATION 192 #######################


> Neighbours evaluated; 16
> Selected Move:	2014	4	5	6	20700


> New Y[]: 
	
	 0  3  0  1  0  4  2  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,285

## ITERATION 193 #######################


> Neighbours evaluated; 15
> Selected Move:	2011	4	5	9	20700


> New Y[]: 
	
	 0  3  0  1  0  1  2  1  0  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,29

## ITERATION 194 #######################


> Neighbours evaluated; 19
> Selected Move:	1900	3	6	0	19000


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  4 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,295

## ITERATION 195 #######################


> Neighbours evaluated; 32
> Selected Move:	2000	3	7	8	18000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  4 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,3

## ITERATION 196 #######################


> Neighbours evaluated; 31
> Selected Move:	2000	4	9	3	19000


> New Y[]: 
	
	 2  3  0  4  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,305

## ITERATION 197 #######################


> Neighbours evaluated; 31
> Selected Move:	2000	4	3	5	18000


> New Y[]: 
	
	 2  3  0  1  0  4  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,31

## ITERATION 198 #######################


> Neighbours evaluated; 30
> Selected Move:	2000	4	5	8	18400


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,315

## ITERATION 199 #######################


> Neighbours evaluated; 28
> Selected Move:	1900	3	8	7	18500


> New Y[]: 
	
	 2  3  0  1  0  1  0  4  0  1 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,31

## ITERATION 200 #######################


> Neighbours evaluated; 29
> Selected Move:	1900	4	7	3	20000


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,305

## ITERATION 201 #######################


> Neighbours evaluated; 30
> Selected Move:	1900	4	3	5	19000


> New Y[]: 
	
	 2  3  0  1  0  4  0  1  0  1 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,3

## ITERATION 202 #######################


> Neighbours evaluated; 28
> Selected Move:	1740	3	3	4	18500


> New Y[]: 
	
	 2  3  0  0  1  4  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,295

## ITERATION 203 #######################


> Neighbours evaluated; 33
> Selected Move:	1740	4	5	4	19700


> New Y[]: 
	
	 2  3  0  0  4  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,29

## ITERATION 204 #######################


> Neighbours evaluated; 32
> Selected Move:	1740	4	4	7	18000


> New Y[]: 
	
	 2  3  0  0  1  1  0  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,285

## ITERATION 205 #######################


> Neighbours evaluated; 31
> Selected Move:	1760	3	1	3	19600


> New Y[]: 
	
	 2  0  0  3  1  1  0  4  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,28

## ITERATION 206 #######################


> Neighbours evaluated; 29
> Selected Move:	1760	4	3	5	20000


> New Y[]: 
	
	 2  0  0  1  1  3  0  4  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,275

## ITERATION 207 #######################


> Neighbours evaluated; 29
> Selected Move:	1760	4	5	7	19100


> New Y[]: 
	
	 2  0  0  1  1  4  0  3  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 208 #######################


> Neighbours evaluated; 28
> Selected Move:	1760	4	5	9	19100


> New Y[]: 
	
	 2  0  0  1  1  1  0  3  0  4 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,265

## ITERATION 209 #######################


> Neighbours evaluated; 29
> Selected Move:	1760	4	7	9	19200


> New Y[]: 
	
	 2  0  0  1  1  1  0  4  0  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,26

## ITERATION 210 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	7	5	19700


> New Y[]: 
	
	 2  0  0  1  1  4  0  1  0  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,255

## ITERATION 211 #######################


> Neighbours evaluated; 29
> Selected Move:	1760	3	7	8	18700


> New Y[]: 
	
	 2  0  0  1  1  4  0  0  1  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,25

## ITERATION 212 #######################


> Neighbours evaluated; 30
> Selected Move:	1760	4	5	3	19700


> New Y[]: 
	
	 2  0  0  4  1  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 213 #######################


> Neighbours evaluated; 30
> Selected Move:	1760	4	3	4	19900


> New Y[]: 
	
	 2  0  0  1  4  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,24

## ITERATION 214 #######################


> Neighbours evaluated; 28
> Selected Move:	1760	4	4	8	19100


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  4  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,235

## ITERATION 215 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	8	9	18600


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  3  4 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,23

## ITERATION 216 #######################


> Neighbours evaluated; 27
> Selected Move:	1760	4	8	3	19100


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  1  4 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,225

## ITERATION 217 #######################


> Neighbours evaluated; 28
> Selected Move:	1760	4	3	4	20000


> New Y[]: 
	
	 2  0  0  1  3  1  0  0  1  4 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,22

## ITERATION 218 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	4	5	19500


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  1  4 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,215

## ITERATION 219 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	9	8	19900


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  4  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,21

## ITERATION 220 #######################


> Neighbours evaluated; 27
> Selected Move:	1760	4	5	3	19500


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  4  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,205

## ITERATION 221 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	3	8	19600


> New Y[]: 
	
	 2  0  0  4  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,2

## ITERATION 222 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	3	4	19800


> New Y[]: 
	
	 2  0  0  1  4  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,195

## ITERATION 223 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	4	5	18600


> New Y[]: 
	
	 2  0  0  1  1  4  0  0  3  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,19

## ITERATION 224 #######################


> Neighbours evaluated; 23
> Selected Move:	1760	4	8	3	19100


> New Y[]: 
	
	 2  0  0  3  1  4  0  0  1  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,185

## ITERATION 225 #######################


> Neighbours evaluated; 27
> Selected Move:	1760	4	3	4	20000


> New Y[]: 
	
	 2  0  0  1  3  4  0  0  1  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,18

## ITERATION 226 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	3	9	6	18500


> New Y[]: 
	
	 2  0  0  1  3  4  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 227 #######################


> Neighbours evaluated; 29
> Selected Move:	1760	4	4	3	17600


> New Y[]: 
	
	 2  0  0  3  1  4  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,17

## ITERATION 228 #######################


> Neighbours evaluated; 29
> Selected Move:	1760	4	3	5	19000


> New Y[]: 
	
	 2  0  0  4  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 229 #######################


> Neighbours evaluated; 29
> Selected Move:	1760	4	3	4	19200


> New Y[]: 
	
	 2  0  0  1  4  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,16

## ITERATION 230 #######################


> Neighbours evaluated; 27
> Selected Move:	1760	4	4	6	19300


> New Y[]: 
	
	 2  0  0  1  1  3  4  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,155

## ITERATION 231 #######################


> Neighbours evaluated; 28
> Selected Move:	1760	4	5	3	18900


> New Y[]: 
	
	 2  0  0  3  1  1  4  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,15

## ITERATION 232 #######################


> Neighbours evaluated; 28
> Selected Move:	1760	4	3	4	19800


> New Y[]: 
	
	 2  0  0  1  3  1  4  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,145

## ITERATION 233 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	4	6	19800


> New Y[]: 
	
	 2  0  0  1  4  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,14

## ITERATION 234 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	4	3	19600


> New Y[]: 
	
	 2  0  0  4  1  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,135

## ITERATION 235 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	3	5	18600


> New Y[]: 
	
	 2  0  0  1  1  4  3  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,13

## ITERATION 236 #######################


> Neighbours evaluated; 24
> Selected Move:	1760	4	5	8	19000


> New Y[]: 
	
	 2  0  0  1  1  1  3  0  4  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,125

## ITERATION 237 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	6	3	18000


> New Y[]: 
	
	 2  0  0  3  1  1  1  0  4  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,12

## ITERATION 238 #######################


> Neighbours evaluated; 26
> Selected Move:	1860	1	-1	9	24000


> New Y[]: 
	
	 2  0  0  3  1  1  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  1  0 
 > pw :0,115

## ITERATION 239 #######################


> Neighbours evaluated; 27
> Selected Move:	2099	3	8	2	22100


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,11

## ITERATION 240 #######################


> Neighbours evaluated; 25
> Selected Move:	2153	4	3	9	21700


> New Y[]: 
	
	 2  0  4  1  1  1  1  0  0  3 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,105

## ITERATION 241 #######################


> Neighbours evaluated; 26
> Selected Move:	2185	3	9	8	21100


> New Y[]: 
	
	 2  0  4  1  1  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,0999999999999996

## ITERATION 242 #######################


> Neighbours evaluated; 29
> Selected Move:	2140	4	8	3	21600


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,105

## ITERATION 243 #######################


> Neighbours evaluated; 26
> Selected Move:	2120	3	5	9	22100


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,11

## ITERATION 244 #######################


> Neighbours evaluated; 29
> Selected Move:	2153	4	3	9	21700


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  1  3 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,115

## ITERATION 245 #######################


> Neighbours evaluated; 29
> Selected Move:	2070	3	9	5	22000


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,12

## ITERATION 246 #######################


> Neighbours evaluated; 25
> Selected Move:	2040	3	8	9	22500


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,125

## ITERATION 247 #######################


> Neighbours evaluated; 22
> Selected Move:	2038	3	5	7	22100


> New Y[]: 
	
	 2  0  4  1  1  0  1  3  0  1 


> New S[]: 
	
	 0  0  1  1  1  0  0  0  0  0 
 > pw :0,13

## ITERATION 248 #######################


> Neighbours evaluated; 31
> Selected Move:	2092	3	9	5	21600


> New Y[]: 
	
	 2  0  4  1  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,135

## ITERATION 249 #######################


> Neighbours evaluated; 29
> Selected Move:	1949	4	7	3	22600


> New Y[]: 
	
	 2  0  4  3  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,14

## ITERATION 250 #######################


> Neighbours evaluated; 29
> Selected Move:	1880	4	3	5	23000


> New Y[]: 
	
	 2  0  4  1  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,145

## ITERATION 251 #######################


> Neighbours evaluated; 28
> Selected Move:	1909	3	5	9	22700


> New Y[]: 
	
	 2  0  4  1  1  0  1  1  0  3 


> New S[]: 
	
	 0  0  1  1  1  0  0  0  0  0 
 > pw :0,15

## ITERATION 252 #######################


> Neighbours evaluated; 30
> Selected Move:	1835	4	9	3	23100


> New Y[]: 
	
	 2  0  4  3  1  0  1  1  0  1 


> New S[]: 
	
	 0  0  1  1  1  0  0  0  0  0 
 > pw :0,155

## ITERATION 253 #######################


> Neighbours evaluated; 29
> Selected Move:	1740	4	0	7	18100


> New Y[]: 
	
	 0  0  4  3  1  0  1  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,16

## ITERATION 254 #######################


> Neighbours evaluated; 28
> Selected Move:	1760	3	2	5	19600


> New Y[]: 
	
	 0  0  0  3  1  4  1  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,165

## ITERATION 255 #######################


> Neighbours evaluated; 27
> Selected Move:	1760	4	3	9	19200


> New Y[]: 
	
	 0  0  0  1  1  4  1  2  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,17

## ITERATION 256 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	5	7	19700


> New Y[]: 
	
	 0  0  0  1  1  2  1  4  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,175

## ITERATION 257 #######################


> Neighbours evaluated; 24
> Selected Move:	1760	4	7	9	19600


> New Y[]: 
	
	 0  0  0  1  1  2  1  3  0  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,18

## ITERATION 258 #######################


> Neighbours evaluated; 24
> Selected Move:	1760	4	5	7	20000


> New Y[]: 
	
	 0  0  0  1  1  3  1  2  0  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,175

## ITERATION 259 #######################


> Neighbours evaluated; 23
> Selected Move:	1760	4	5	3	19600


> New Y[]: 
	
	 0  0  0  3  1  1  1  2  0  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,17

## ITERATION 260 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	3	7	8	19700


> New Y[]: 
	
	 0  0  0  3  1  1  1  0  2  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,165

## ITERATION 261 #######################


> Neighbours evaluated; 27
> Selected Move:	1760	4	3	8	19700


> New Y[]: 
	
	 0  0  0  2  1  1  1  0  3  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,16

## ITERATION 262 #######################


> Neighbours evaluated; 25
> Selected Move:	1760	4	3	5	19100


> New Y[]: 
	
	 0  0  0  1  1  2  1  0  3  4 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,155

## ITERATION 263 #######################


> Neighbours evaluated; 24
> Selected Move:	1760	4	5	9	19500


> New Y[]: 
	
	 0  0  0  1  1  4  1  0  3  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,15

## ITERATION 264 #######################


> Neighbours evaluated; 24
> Selected Move:	1760	4	8	3	20000


> New Y[]: 
	
	 0  0  0  3  1  4  1  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,145

## ITERATION 265 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	3	9	19800


> New Y[]: 
	
	 0  0  0  2  1  4  1  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,14

## ITERATION 266 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	3	8	19300


> New Y[]: 
	
	 0  0  0  1  1  4  1  0  2  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,135

## ITERATION 267 #######################


> Neighbours evaluated; 23
> Selected Move:	1760	4	5	8	19600


> New Y[]: 
	
	 0  0  0  1  1  2  1  0  4  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,13

## ITERATION 268 #######################


> Neighbours evaluated; 21
> Selected Move:	1760	4	9	3	20000


> New Y[]: 
	
	 0  0  0  3  1  2  1  0  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,125

## ITERATION 269 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	5	8	19700


> New Y[]: 
	
	 0  0  0  3  1  4  1  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,12

## ITERATION 270 #######################


> Neighbours evaluated; 22
> Selected Move:	1760	4	3	8	19700


> New Y[]: 
	
	 0  0  0  2  1  4  1  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,115

## ITERATION 271 #######################


> Neighbours evaluated; 22
> Selected Move:	1749	4	3	5	20100


> New Y[]: 
	
	 0  0  0  4  1  2  1  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,11

## ITERATION 272 #######################


> Neighbours evaluated; 22
> Selected Move:	1740	3	3	2	18100


> New Y[]: 
	
	 0  0  4  0  1  2  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  1 
 > pw :0,105

## ITERATION 273 #######################


> Neighbours evaluated; 24
> Selected Move:	1975	1	-1	3	23100


> New Y[]: 
	
	 0  0  4  1  1  2  1  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0999999999999996

## ITERATION 274 #######################


> Neighbours evaluated; 24
> Selected Move:	2150	3	8	1	21500


> New Y[]: 
	
	 0  3  4  1  1  2  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0949999999999996

## ITERATION 275 #######################


> Neighbours evaluated; 18
> Selected Move:	2120	4	5	9	21900


> New Y[]: 
	
	 0  3  4  1  1  1  1  0  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0899999999999996

## ITERATION 276 #######################


> Neighbours evaluated; 18
> Selected Move:	2111	4	9	3	22100


> New Y[]: 
	
	 0  3  4  2  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0949999999999996

## ITERATION 277 #######################


> Neighbours evaluated; 19
> Selected Move:	2044	4	3	6	22700


> New Y[]: 
	
	 0  3  4  1  1  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0999999999999996

## ITERATION 278 #######################


> Neighbours evaluated; 16
> Selected Move:	2010	4	6	4	22900


> New Y[]: 
	
	 0  3  4  1  2  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,105

## ITERATION 279 #######################


> Neighbours evaluated; 16
> Selected Move:	2027	3	4	8	22600


> New Y[]: 
	
	 0  3  4  1  0  1  1  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,11

## ITERATION 280 #######################


> Neighbours evaluated; 20
> Selected Move:	2025	4	8	5	22500


> New Y[]: 
	
	 0  3  4  1  0  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,115

## ITERATION 281 #######################


> Neighbours evaluated; 19
> Selected Move:	1967	4	5	9	22900


> New Y[]: 
	
	 0  3  4  1  0  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,12

## ITERATION 282 #######################


> Neighbours evaluated; 21
> Selected Move:	1928	4	9	3	23100


> New Y[]: 
	
	 0  3  4  2  0  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,125

## ITERATION 283 #######################


> Neighbours evaluated; 21
> Selected Move:	1880	2	8	-1	17600


> New Y[]: 
	
	 0  3  4  2  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,13

## ITERATION 284 #######################


> Neighbours evaluated; 21
> Selected Move:	1880	4	3	5	17000


> New Y[]: 
	
	 0  3  4  1  0  2  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,135

## ITERATION 285 #######################


> Neighbours evaluated; 20
> Selected Move:	1880	4	5	6	18200


> New Y[]: 
	
	 0  3  4  1  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,14

## ITERATION 286 #######################


> Neighbours evaluated; 18
> Selected Move:	1880	4	6	9	17400


> New Y[]: 
	
	 0  3  4  1  0  1  1  0  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,145

## ITERATION 287 #######################


> Neighbours evaluated; 21
> Selected Move:	1880	3	9	0	15000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,15

## ITERATION 288 #######################


> Neighbours evaluated; 28
> Selected Move:	1985	1	-1	7	21500


> New Y[]: 
	
	 2  3  4  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,155

## ITERATION 289 #######################


> Neighbours evaluated; 29
> Selected Move:	1980	3	5	9	22000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,16

## ITERATION 290 #######################


> Neighbours evaluated; 37
> Selected Move:	1810	3	3	5	22500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,165

## ITERATION 291 #######################


> Neighbours evaluated; 35
> Selected Move:	1715	3	6	3	23000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,17

## ITERATION 292 #######################


> Neighbours evaluated; 24
> Selected Move:	1900	4	1	7	18600


> New Y[]: 
	
	 2  0  4  1  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  1  1  0  1  0  0  0  0 
 > pw :0,165

## ITERATION 293 #######################


> Neighbours evaluated; 27
> Selected Move:	1789	1	-1	4	23100


> New Y[]: 
	
	 2  0  4  1  1  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,17

## ITERATION 294 #######################


> Neighbours evaluated; 28
> Selected Move:	1858	3	3	6	22600


> New Y[]: 
	
	 2  0  4  0  1  1  1  3  0  1 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,175

## ITERATION 295 #######################


> Neighbours evaluated; 29
> Selected Move:	1933	3	7	8	22100


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,18

## ITERATION 296 #######################


> Neighbours evaluated; 27
> Selected Move:	1904	4	8	9	22200


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,185

## ITERATION 297 #######################


> Neighbours evaluated; 29
> Selected Move:	1841	3	4	3	22700


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,19

## ITERATION 298 #######################


> Neighbours evaluated; 24
> Selected Move:	1846	4	9	8	22600


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,195

## ITERATION 299 #######################


> Neighbours evaluated; 22
> Selected Move:	1793	3	6	4	22600


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,2

## ITERATION 300 #######################


> Neighbours evaluated; 22
> Selected Move:	1760	4	8	9	22700


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,205

## ITERATION 301 #######################


> Neighbours evaluated; 22
> Selected Move:	1767	3	9	6	22600


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 302 #######################


> Neighbours evaluated; 22
> Selected Move:	1775	4	6	4	22500


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 303 #######################


> Neighbours evaluated; 24
> Selected Move:	1760	4	2	3	19500


> New Y[]: 
	
	 2  0  0  4  3  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 304 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	3	4	18800


> New Y[]: 
	
	 2  0  0  3  4  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 305 #######################


> Neighbours evaluated; 23
> Selected Move:	1760	4	3	8	18300


> New Y[]: 
	
	 2  0  0  1  4  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 306 #######################


> Neighbours evaluated; 25
> Selected Move:	1760	4	4	3	18100


> New Y[]: 
	
	 2  0  0  4  1  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 307 #######################


> Neighbours evaluated; 23
> Selected Move:	1760	4	3	5	17100


> New Y[]: 
	
	 2  0  0  1  1  4  1  0  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 308 #######################


> Neighbours evaluated; 23
> Selected Move:	1760	4	5	6	18400


> New Y[]: 
	
	 2  0  0  1  1  1  4  0  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 309 #######################


> Neighbours evaluated; 21
> Selected Move:	1760	3	8	7	18900


> New Y[]: 
	
	 2  0  0  1  1  1  4  3  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 310 #######################


> Neighbours evaluated; 28
> Selected Move:	1760	4	6	3	18600


> New Y[]: 
	
	 2  0  0  4  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 311 #######################


> Neighbours evaluated; 28
> Selected Move:	1760	4	3	4	18800


> New Y[]: 
	
	 2  0  0  1  4  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 312 #######################


> Neighbours evaluated; 26
> Selected Move:	1760	4	4	5	17600


> New Y[]: 
	
	 2  0  0  1  1  4  1  3  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 313 #######################


> Neighbours evaluated; 25
> Selected Move:	1760	4	5	7	18500


> New Y[]: 
	
	 2  0  0  1  1  3  1  4  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 314 #######################


> Neighbours evaluated; 27
> Selected Move:	1760	4	5	3	18100


> New Y[]: 
	
	 2  0  0  3  1  1  1  4  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,205

## ITERATION 315 #######################


> Neighbours evaluated; 25
> Selected Move:	1760	4	3	4	19000


> New Y[]: 
	
	 2  0  0  1  3  1  1  4  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,2

## ITERATION 316 #######################


> Neighbours evaluated; 25
> Selected Move:	1760	4	4	6	19100


> New Y[]: 
	
	 2  0  0  1  1  1  3  4  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 317 #######################


> Neighbours evaluated; 23
> Selected Move:	1760	4	7	5	19600


> New Y[]: 
	
	 2  0  0  1  1  4  3  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,19

## ITERATION 318 #######################


> Neighbours evaluated; 27
> Selected Move:	1760	4	6	3	18600


> New Y[]: 
	
	 2  0  0  3  1  4  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 319 #######################


> Neighbours evaluated; 27
> Selected Move:	1760	4	3	4	19500


> New Y[]: 
	
	 2  0  0  1  3  4  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,18

## ITERATION 320 #######################


> Neighbours evaluated; 25
> Selected Move:	1740	3	5	2	18000


> New Y[]: 
	
	 2  0  4  1  3  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 321 #######################


> Neighbours evaluated; 32
> Selected Move:	1740	4	4	3	17100


> New Y[]: 
	
	 2  0  4  3  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,17

## ITERATION 322 #######################


> Neighbours evaluated; 29
> Selected Move:	1740	4	3	6	18100


> New Y[]: 
	
	 2  0  4  1  1  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 323 #######################


> Neighbours evaluated; 30
> Selected Move:	1740	4	6	7	16100


> New Y[]: 
	
	 2  0  4  1  1  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,16

## ITERATION 324 #######################


> Neighbours evaluated; 27
> Selected Move:	1740	3	0	5	17600


> New Y[]: 
	
	 0  0  4  1  1  2  1  3  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  1  0  0  0 
 > pw :0,155

## ITERATION 325 #######################


> Neighbours evaluated; 26
> Selected Move:	1742	1	-1	9	23600


> New Y[]: 
	
	 0  0  4  1  1  2  1  3  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,15

## ITERATION 326 #######################


> Neighbours evaluated; 23
> Selected Move:	1740	2	3	-1	18600


> New Y[]: 
	
	 0  0  4  0  1  2  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  1 
 > pw :0,145

## ITERATION 327 #######################


> Neighbours evaluated; 23
> Selected Move:	1740	4	5	4	20000


> New Y[]: 
	
	 0  0  4  0  2  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  1 
 > pw :0,14

## ITERATION 328 #######################


> Neighbours evaluated; 24
> Selected Move:	1740	4	4	6	19800


> New Y[]: 
	
	 0  0  4  0  1  1  2  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  1 
 > pw :0,135

## ITERATION 329 #######################


> Neighbours evaluated; 24
> Selected Move:	1740	4	6	7	19600


> New Y[]: 
	
	 0  0  4  0  1  1  3  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  1 
 > pw :0,13

## ITERATION 330 #######################


> Neighbours evaluated; 24
> Selected Move:	1740	4	6	4	19500


> New Y[]: 
	
	 0  0  4  0  3  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  1 
 > pw :0,125

## ITERATION 331 #######################


> Neighbours evaluated; 23
> Selected Move:	1740	4	4	5	19000


> New Y[]: 
	
	 0  0  4  0  1  3  1  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  1 
 > pw :0,12

## ITERATION 332 #######################


> Neighbours evaluated; 21
> Selected Move:	1820	1	-1	3	24000


> New Y[]: 
	
	 0  0  4  1  1  3  1  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,115

## ITERATION 333 #######################


> Neighbours evaluated; 23
> Selected Move:	1932	4	5	9	23200


> New Y[]: 
	
	 0  0  4  1  1  1  1  2  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,11

## ITERATION 334 #######################


> Neighbours evaluated; 25
> Selected Move:	1937	3	7	8	23300


> New Y[]: 
	
	 0  0  4  1  1  1  1  0  2  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,105

## ITERATION 335 #######################


> Neighbours evaluated; 25
> Selected Move:	1964	4	8	5	23200


> New Y[]: 
	
	 0  0  4  1  1  2  1  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,0999999999999996

## ITERATION 336 #######################


> Neighbours evaluated; 23
> Selected Move:	1940	4	9	3	23600


> New Y[]: 
	
	 0  0  4  3  1  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,105

## ITERATION 337 #######################


> Neighbours evaluated; 23
> Selected Move:	1912	4	5	8	23700


> New Y[]: 
	
	 0  0  4  3  1  1  1  0  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,11

## ITERATION 338 #######################


> Neighbours evaluated; 23
> Selected Move:	1904	3	8	7	23600


> New Y[]: 
	
	 0  0  4  3  1  1  1  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,115

## ITERATION 339 #######################


> Neighbours evaluated; 21
> Selected Move:	1817	4	3	7	24200


> New Y[]: 
	
	 0  0  4  2  1  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,12

## ITERATION 340 #######################


> Neighbours evaluated; 23
> Selected Move:	1856	3	7	8	23700


> New Y[]: 
	
	 0  0  4  2  1  1  1  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,125

## ITERATION 341 #######################


> Neighbours evaluated; 20
> Selected Move:	1863	4	3	9	23500


> New Y[]: 
	
	 0  0  4  1  1  1  1  0  3  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,13

## ITERATION 342 #######################


> Neighbours evaluated; 21
> Selected Move:	1780	4	8	3	24000


> New Y[]: 
	
	 0  0  4  3  1  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,135

## ITERATION 343 #######################


> Neighbours evaluated; 22
> Selected Move:	1787	4	3	9	23800


> New Y[]: 
	
	 0  0  4  2  1  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,14

## ITERATION 344 #######################


> Neighbours evaluated; 20
> Selected Move:	1740	2	5	-1	18300


> New Y[]: 
	
	 0  0  4  2  1  0  1  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,145

## ITERATION 345 #######################


> Neighbours evaluated; 27
> Selected Move:	1740	4	3	4	19100


> New Y[]: 
	
	 0  0  4  1  2  0  1  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,15

## ITERATION 346 #######################


> Neighbours evaluated; 27
> Selected Move:	1740	4	4	6	18900


> New Y[]: 
	
	 0  0  4  1  1  0  2  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,155

## ITERATION 347 #######################


> Neighbours evaluated; 26
> Selected Move:	1740	4	6	8	17800


> New Y[]: 
	
	 0  0  4  1  1  0  1  0  2  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,16

## ITERATION 348 #######################


> Neighbours evaluated; 23
> Selected Move:	1740	4	8	9	18000


> New Y[]: 
	
	 0  0  4  1  1  0  1  0  3  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,165

## ITERATION 349 #######################


> Neighbours evaluated; 24
> Selected Move:	1740	4	8	3	18500


> New Y[]: 
	
	 0  0  4  3  1  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,16

## ITERATION 350 #######################


> Neighbours evaluated; 23
> Selected Move:	1740	4	3	4	19400


> New Y[]: 
	
	 0  0  4  1  3  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,155

## ITERATION 351 #######################


> Neighbours evaluated; 24
> Selected Move:	1740	4	4	6	19500


> New Y[]: 
	
	 0  0  4  1  1  0  3  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,15

## ITERATION 352 #######################


> Neighbours evaluated; 23
> Selected Move:	1740	4	9	3	19700


> New Y[]: 
	
	 0  0  4  2  1  0  3  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,145

## ITERATION 353 #######################


> Neighbours evaluated; 27
> Selected Move:	1740	4	3	6	19300


> New Y[]: 
	
	 0  0  4  3  1  0  2  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,14

## ITERATION 354 #######################


> Neighbours evaluated; 24
> Selected Move:	1740	4	3	8	18800


> New Y[]: 
	
	 0  0  4  1  1  0  2  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,135
________________________________________________________________

Best solution found: 2320
Run Termination time: 03.02.2010 20:18:33
Run duration: 00:01:03.2187500
________________________________________________________________
